Disjoint Directed Cycles
نویسنده
چکیده
It is shown that there exists a positive so that for any integer k, every directed graph with minimum outdegree at least k contains at least k vertex disjoint cycles. On the other hand, for every k there is a digraph with minimum outdegree k which does not contain two vertex or edge disjoint cycles of the same length.
منابع مشابه
Edge-disjoint cycles in regular directed graphs
We prove that any k-regular directed graph with no parallel edges contains a collection of at least Ω(k) edge-disjoint cycles, conjecture that in fact any such graph contains a collection of at least ( k+1 2 ) disjoint cycles, and note that this holds for k ≤ 3. In this paper we consider the maximum size of a collection of edge-disjoint cycles in a directed graph. We pose the following conjectu...
متن کاملDisjoint Cycles of Different Lengths in Graphs and Digraphs
In this paper, we study the question of finding a set of k vertex-disjoint cycles (resp. directed cycles) of distinct lengths in a given graph (resp. digraph). In the context of undirected graphs, we prove that, for every k > 1, every graph with minimum degree at least k 2+5k−2 2 has k vertex-disjoint cycles of different lengths, where the degree bound is best possible. We also consider other c...
متن کاملOn vertex disjoint cycles of different lengths in 3-regular digraphs
Henning and Yeo [SIAM J. Discrete Math. 26 (2012) 687–694] conjectured that a 3-regular digraph D contains two vertex disjoint directed cycles of different length if either D is of sufficiently large order or D is bipartite. In this paper, we disprove the first conjecture. Further, we give support for the second conjecture by proving that every bipartite 3-regular digraph, which either possesse...
متن کاملArc-Disjoint Cycles and Feedback Arc Sets
Isaak posed the following problem. Suppose T is a tournament having a minimum feedback arc set which induces an acyclic digraph with a hamiltonian path. Is it true that the maximum number of arc-disjoint cycles in T equals the cardinality of minimum feedback arc set of T? We prove that the answer to the problem is in the negative. Further, we study the number of arc-disjoint cycles through a ve...
متن کاملOn disjoint directed cycles with prescribed minimum lengths
In this paper, we show that the k-Linkage problem is polynomial-time solvable for digraphs with circumference at most 2. We also show that the directed cycles of length at least 3 have the Erdős-Pósa Property : for every n, there exists an integer tn such that for every digraph D, either D contains n disjoint directed cycles of length at least 3, or there is a set T of tn vertices that meets ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 68 شماره
صفحات -
تاریخ انتشار 1996